/**
 * 快速排序：最快的内排方法。O(nlogn)
 */

public class QuickSort {
    public static void main(String[] args) {
        int[] arr = new int[]{2, 20, -1, 40, -10, 20, 3, 5, 2};
        sort(arr, 0, arr.length);
        for (int i : arr) {
            System.out.println(i);
        }
    }

    private static void sort(int[] arr, int start, int length) {
        int pivot = start;
        int low = start + 1;
        int high = start + length - 1;


    }
}
